A Fast Multiobjective Fuzzy Clustering with Multimeasures Combination

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Fuzzy Clustering Algorithm

Clustering algorithms have been utilized in a wide variety of application areas. One of these algorithms is the Fuzzy C-Means algorithm (FCM). One of the problems with these algorithms is the time needed to converge. In this paper, a Fast Fuzzy C-Means algorithm (FFCM) is proposed based on experimentations, for improving fuzzy clustering. The algorithm is based on decreasing the number of dista...

متن کامل

Fast fuzzy clustering

This paper presents a multistage random sampling fuzzy c-means based clustering algorithm, which signi cantly reduces the computation time required to partition a data set into c classes. A series of subsets of the full data set are used for classi cation in order to provide an approximation to the nal cluster centers. The quality of the nal partitions is equivalent to that of fuzzy c-means. Th...

متن کامل

On Darboux Property of Fuzzy Multimeasures

We present some properties regarding Darboux property, non-atomicity, regular fuzziness of multimeasures taking values in the family of all closed nonvoid subsets of a real normed space. Key–words: Darboux property, fuzzy multimeasure, atom, non-atomic, regular, diffused.

متن کامل

A multiobjective spatial fuzzy clustering algorithm for image segmentation

This article describes a multiobjective spatial fuzzy clustering algorithm for image segmentation. To obtain satisfactory segmentation performance for noisy images, the proposed method introduces the non-local spatial information derived from the image into fitness functions which respectively consider the global fuzzy compactness and fuzzy separation among the clusters. After producing the set...

متن کامل

Multiobjective security game with fuzzy payoffs

A multiobjective security game problem with fuzzy payoffs is studied in this paper. The problem is formulated as a bilevel programming problem with fuzzy coefficients. Using the idea of nearest interval approximation of fuzzy numbers, the problem is transformed into a bilevel programming problem with interval coefficients. The Karush-Kuhn-Tucker conditions is applied then to reduce the problem ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2019

ISSN: 1024-123X,1563-5147

DOI: 10.1155/2019/3821025